Stochastic Games with Lossy Channels
نویسندگان
چکیده
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLCS). We study games with Büchi (repeated reachability) objectives and almost-sure winning conditions. These games are pure memoryless determined and, under the assumption that the target set is regular, a symbolic representation of the set of winning states for each player can be effectively constructed. Thus, turn-based stochastic games on GPLCS are decidable. This generalizes the decidability result for PLCS-induced Markov decision processes in [9].
منابع مشابه
Stochastic Parity Games on Lossy Channel Systems
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, under the constraint that both players are restricted to finitememory strategies. First, we describe a general framework, where we consider the class of 2 2 -player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contain...
متن کاملLossy Channel Games under Incomplete Information
In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under incomplete information, while the other player, representing the component’s environment is allowed to lose messages from the channels. We argue that these games are ...
متن کاملar X iv : 1 30 5 . 52 28 v 2 [ cs . G T ] 1 3 Ju n 20 13 Stochastic Parity Games on Lossy Channel Systems ⋆
We give an algorithm for solving stochastic parity games with almostsure winning conditions on lossy channel systems, for the case where the players are restricted to finite-memory strategies. First, we describe a general framework, where we consider the class of 2 2 -player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contains a fini...
متن کاملFast adaptive learning in repeated stochastic games by game abstraction
An agent must learn and adapt quickly when playing against other agents. This process is challenging in particular when playing in stochastic environments against other learning agents. In this paper, we introduce a fast and adaptive learning algorithm for repeated stochastic games (FAL-SG). FALSG utilizes lossy game abstraction to reduce the state space of the game and facilitate learning and ...
متن کاملSolving Stochastic B\"uchi Games on Infinite Arenas with a Finite Attractor
We consider games played on an infinite probabilistic arena where the first player aims at satisfying generalized Büchi objectives almost surely, i.e., with probability one. We provide a fixpoint characterization of the winning sets and associated winning strategies in the case where the arena satisfies the finite-attractor property. From this we directly deduce the decidability of these games ...
متن کامل